Embedding problem

Results: 42



#Item
11Seminar on Algorithms and Geometry – Handout 4 Robert Krauthgamer April 23, 2009 Homework This problem set refers to the April 16 presentation about probabilistic embedding into trees

Seminar on Algorithms and Geometry – Handout 4 Robert Krauthgamer April 23, 2009 Homework This problem set refers to the April 16 presentation about probabilistic embedding into trees

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2009-04-23 11:37:23
    12OPTIMAL TRANSPORT AND SKOROKHOD EMBEDDING ¨ MATHIAS BEIGLBOCK, ALEXANDER M. G. COX, AND MARTIN HUESMANN Abstract. The Skorokhod embedding problem is to represent a given probability as the distribution of Brownian motio

    OPTIMAL TRANSPORT AND SKOROKHOD EMBEDDING ¨ MATHIAS BEIGLBOCK, ALEXANDER M. G. COX, AND MARTIN HUESMANN Abstract. The Skorokhod embedding problem is to represent a given probability as the distribution of Brownian motio

    Add to Reading List

    Source URL: www.mat.univie.ac.at

    Language: English - Date: 2015-02-27 09:23:02
      13Seminar on Algorithms and Geometry 2014B – Problem Set 3 Robert Krauthgamer May 15, 2014 We discussed in class low-distortion metric embeddings, and in particular a probabilistic embedding into dominating trees.

      Seminar on Algorithms and Geometry 2014B – Problem Set 3 Robert Krauthgamer May 15, 2014 We discussed in class low-distortion metric embeddings, and in particular a probabilistic embedding into dominating trees.

      Add to Reading List

      Source URL: www.wisdom.weizmann.ac.il

      - Date: 2014-05-15 11:57:38
        14Algorithms for the Edge-Width of an Embedded Graph∗ Sergio Cabello† ´ Eric Colin de Verdi`ere‡

        Algorithms for the Edge-Width of an Embedded Graph∗ Sergio Cabello† ´ Eric Colin de Verdi`ere‡

        Add to Reading List

        Source URL: www.di.ens.fr

        Language: English - Date: 2012-02-15 15:38:13
        15Shortest Cut Graph of a Surface with Prescribed Vertex Set ´ Eric Colin de Verdi`ere⋆ ´

        Shortest Cut Graph of a Surface with Prescribed Vertex Set ´ Eric Colin de Verdi`ere⋆ ´

        Add to Reading List

        Source URL: www.di.ens.fr

        Language: English - Date: 2010-06-23 07:19:49
        16Topological Algorithms for Graphs on Surfaces (Algorithmes topologiques pour les graphes tracés sur des surfaces) par

        Topological Algorithms for Graphs on Surfaces (Algorithmes topologiques pour les graphes tracés sur des surfaces) par

        Add to Reading List

        Source URL: www.di.ens.fr

        Language: English - Date: 2012-05-21 03:16:48
        17Graph Crossing Number and Isomorphism SPUR Final Paper, Summer 2012 Mark Velednitsky Mentor Adam Bouland Problem suggested by Adam Bouland, Jacob Fox MIT

        Graph Crossing Number and Isomorphism SPUR Final Paper, Summer 2012 Mark Velednitsky Mentor Adam Bouland Problem suggested by Adam Bouland, Jacob Fox MIT

        Add to Reading List

        Source URL: math.mit.edu

        Language: English - Date: 2013-02-04 10:20:57
        18Approximation Algorithms for Bounded Dimensional Metric Spaces T.-H. Hubert Chan CMU-CSSeptember 2007

        Approximation Algorithms for Bounded Dimensional Metric Spaces T.-H. Hubert Chan CMU-CSSeptember 2007

        Add to Reading List

        Source URL: i.cs.hku.hk

        Language: English - Date: 2007-10-10 15:19:14
        19It’s About Time: On Optimal Virtual Network Embeddings under Temporal Flexibilities ∗ Internet Matthias Rost∗ , Stefan Schmid∗† , Anja Feldmann∗ Network Architectures, Technische Universität Berlin, Germany

        It’s About Time: On Optimal Virtual Network Embeddings under Temporal Flexibilities ∗ Internet Matthias Rost∗ , Stefan Schmid∗† , Anja Feldmann∗ Network Architectures, Technische Universität Berlin, Germany

        Add to Reading List

        Source URL: www.net.t-labs.tu-berlin.de

        Language: English - Date: 2014-10-15 13:33:26